Sequentially consistent versus linearizable counting networks
نویسندگان
چکیده
منابع مشابه
A Sequentially Consistent Distributed Shared Memory
Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simpliies programming. An important class of DSM implementations is one which uses cache memories to improve eeciency. In this paper, we present a cache-consistency protocol for DSM which requires signiicantly less communication than previously proposed protocols. This is achieved by maint...
متن کاملMaximal Causal Models for Sequentially Consistent Systems
This paper shows that it is possible to build a maximal and sound causal model for concurrent computations from a given execution trace. It is sound, in the sense that any program which can generate a trace can also generate all traces in its causal model. It is maximal (among sound models), in the sense that by extending the causal model of an observed trace with a new trace, the model becomes...
متن کاملShow No Weakness: Sequentially Consistent Specifications of TSO Libraries
Modern programming languages, such as C++ and Java, provide a sequentially consistent (SC) memory model for well-behaved programs that follow a certain synchronisation discipline, e.g., for those that are data-race free (DRF). However, performance-critical libraries often violate the discipline by using lowlevel hardware primitives, which have a weaker semantics. In such scenarios, it is import...
متن کاملAn Efficient Implementation of Sequentially Consistent Distributed Shared Memories
Recently, distributed shared memory systems have received much attention because such an abstraction simpliies programming. In this paper , we present a data consistency protocol for a distributed system which implements sequentially consistent memories. The protocol is aimed at an environment where no special support for atomic broadcast exists. As compared to previously proposed protocols, ou...
متن کاملFTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications
We introduce FTRepMI, a simple fault-tolerant protocol for providing sequential consistency amongst replicated objects in a grid, without using any centralized components. FTRepMI supports dynamic joins and graceful leaves of processes holding a replica, as well as failstop crashes. Performance evaluation shows that FTRepMI behaves efficiently, both on a single cluster and on a distributed clus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2008
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-008-0066-0